Supervised Hashing Using Graph Cuts and Boosted Decision Trees
نویسندگان
چکیده
منابع مشابه
Semi-supervised graph partitioning with decision trees.
In this paper we investigate a new framework for graph partitioning using decision trees to search for sub-graphs within a graph adjacency matrix. Graph partitioning by a decision tree seeks to optimize a specified graph partitioning index such as ratio cut by recursively applying decision rules found within nodes of the graph. Key advantages of tree models for graph partitioning are they provi...
متن کاملVentriculogram segmentation using boosted decision trees
Left ventricular status, reflected in ejection fraction or end systolic volume, is a powerful prognostic indicator in heart disease. Quantitative analysis of these and other parameters from ventriculograms is infrequently performed due to the expense of manual segmentation. We present a method for semi-automatic segmentation of ventriculograms based on a two-stage boosted decision-tree pixel cl...
متن کاملDecision trees, boosted decision trees, branching programs, neural nets intro
Administrative: • Enrollment should be good now. • Next homework will go out next Wednesday or Friday. • Recap of where we are in course, and interplay between representation, optimization, and generalization; usual story is that as representation power improves, optimization and generalization become more painful. • Many basic latex errors in assignments; please consult lshort for an easy refe...
متن کاملMotion Segmentation Using Spanning Trees and Graph Cuts
Motion segmentation in videos involves identifying regions in the frames of the video that correspond to independently moving objects. This is one of the key techniques that help solve various problems encountered when dealing with image sequences, such as redundancy elimination in digital video and tracking of moving objects. Graph theoretic approaches have been widely used for performing segm...
متن کاملGraph Cuts for Supervised Binary Coding
Learning short binary codes is challenged by the inherent discrete nature of the problem. The graph cuts algorithm is a well-studied discrete label assignment solution in computer vision, but has not yet been applied to solve the binary coding problems. This is partially because it was unclear how to use it to learn the encoding (hashing) functions for out-of-sample generalization. In this pape...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Pattern Analysis and Machine Intelligence
سال: 2015
ISSN: 0162-8828,2160-9292
DOI: 10.1109/tpami.2015.2404776